package LeetCode刷题;

/**
 * @program: Java_Study
 * @author: Xiaofan
 * @createTime: 2021-10-26 14:09
 * @description: Functions of this class is
 * 官方解法：（动态规划）
 * class Solution {
 *     public boolean isMatch(String s, String p) {
 *         int m = s.length();
 *         int n = p.length();
 *
 *         boolean[][] f = new boolean[m + 1][n + 1];
 *         f[0][0] = true;
 *         for (int i = 0; i <= m; ++i) {???
 *             for (int j = 1; j <= n; ++j) {
 *                 if (p.charAt(j - 1) == '*') {
 *                     f[i][j] = f[i][j - 2];
 *                     if (matches(s, p, i, j - 1)) {
 *                         f[i][j] = f[i][j] || f[i - 1][j];???
 *                     }
 *                 } else {
 *                     if (matches(s, p, i, j)) {
 *                         f[i][j] = f[i - 1][j - 1];
 *                     }
 *                 }
 *             }
 *         }
 *         return f[m][n];
 *     }
 *
 *     public boolean matches(String s, String p, int i, int j) {
 *         if (i == 0) {
 *             return false;
 *         }
 *         if (p.charAt(j - 1) == '.') {
 *             return true;
 *         }
 *         return s.charAt(i - 1) == p.charAt(j - 1);
 *     }
 * }

 **/
public class NoNoNo动态规划正则表达式匹配 {
    public static void main(String args[]){

    }
    public static boolean isMatch(String s, String p) {
        return true;
    }
}